Designs from pairs of finite fields. A cyclic unital U(6) and other regular steiner 2-designs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Few More Cyclic Steiner 2-Designs

In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 ≤ t ≤ 50 using computer programs, which are useful in recursive constructions for cyclic designs. Applications of these designs to optical orthogonal codes are also mentioned.

متن کامل

Product constructions for cyclic block designs II. Steiner 2-designs

In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...

متن کامل

Halving Steiner 2-designs

A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into Kks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In th...

متن کامل

High-rate LDPC codes from unital designs

This paper presents a construction of very high-rate low-density parity-check (LDPC) codes based on the incidence matrices of unital designs. Like the projective geometry and oval designs, unital designs exist with incidence matrices which are significantly rank deficient. Thus high-rate LDPC codes with a large number of linearly dependent parity-check equations can be constructed. The LDPC cod...

متن کامل

Tactical decompositions of designs over finite fields

Abstract. An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the coefficients of tactical decomposition matrices. In this article we present results obtained for tactical decompositions of q-analogs of t-designs, mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1989

ISSN: 0097-3165

DOI: 10.1016/0097-3165(89)90061-7